A Non - spectral Estimate of the Cayley Diameter of SL 2 ( F p )

نویسنده

  • Michael Larsen
چکیده

It is well known that SL2(Fp) is generated by ( 1 1 0 1 ) and ( 1 0 1 1 ) . It is a much deeper theorem [4] that the Cayley diameter of this group with respect to these generators is O(log p). The proof depends on uniformly bounding the eigenvalues of the Laplacian on L0(X(p)) away from zero. This argument is, of course, very far from constructive. (For certain other sets of generators, A. Lubotzky, R. Phillips, and P. Sarnak gave a non-spectral, but still non-constructive, argument for the logarithmic growth of the Cayley diameter of SL2(Fp) [5].) Lubotzky asked [4] whether one can efficiently find short word representations of general elements of SL2(Fp). In this note we give an elementary, constructive proof that every element has a word representation of length O(log p log log p). The argument gives a probabilistic algorithm with average running time polynomial in log p for finding a word representing a given element. More precisely, we prove

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Navigating the Cayley Graph of Sl 2 (f P )

deeper theorem [6] that the Cayley diameter of this group with respect to these generators is O(log p). There are two known proofs. One depends on uniformly bounding the eigenvalues of the Laplacian on L0(X(p)) away from zero [6]. The other uses the circle method to show that any element of SL2(Fp) lifts to an element of SL2(Z) which has a short word representation [7]. Neither method is constr...

متن کامل

Normal edge-transitive Cayley graphs on the non-abelian groups of order $4p^2$, where $p$ is a prime number

In this paper, we determine all of connected normal edge-transitive Cayley graphs on non-abelian groups with order $4p^2$, where $p$ is a prime number.

متن کامل

COMPUTING THE EIGENVALUES OF CAYLEY GRAPHS OF ORDER p2q

A graph is called symmetric if its full automorphism group acts transitively on the set of arcs. The Cayley graph $Gamma=Cay(G,S)$ on group $G$ is said to be normal symmetric if $N_A(R(G))=R(G)rtimes Aut(G,S)$ acts transitively on the set of arcs of $Gamma$. In this paper, we classify all connected tetravalent normal symmetric Cayley graphs of order $p^2q$ where $p>q$ are prime numbers.

متن کامل

SOME GRAPH PARAMETERS ON THE COMPOSITE ORDER CAYLEY GRAPH

In this paper, the composite order Cayley graph Cay(G, S) is introduced, where G is a group and S is the set of all composite order elements of G. Some graph parameters such as diameter, girth, clique number, independence number, vertex chromatic number and domination number are calculated for the composite order Cayley graph of some certain groups. Moreover, the planarity of composite order Ca...

متن کامل

Applications of Cayley Graphs

This paper demonstrates the power of the Cayley graph approach to solve specific applications , such as rearrangement problems and the design of interconnection networks for parallel CPU's. Recent results of the authors for efficient use of Cayley graphs are used here in exploratory analysis to extend recent results of Babai et al. on a family of trivalent Cayley graphs associated with P SL 2 (...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2002